CS 792 Notes : Lecture 14

نویسنده

  • Assaf Kfoury
چکیده

• P = {1, 2, 3, . . .} • Seq = {< n1, . . . , nk > | k > 0, n1, . . . , nk ∈ P}. p, q, r and s, possibly decorated, are metavariables ranging over Seq. • If p =< m1, . . . ,mk > and q =< n1, . . . , nl > then p ∗ q = 〈m1, . . . ,mk, n1, . . . , nl〉. • p ∗ 〈 〉 = 〈 〉 ∗ p = p for every p ∈ Seq. • p 6 q iff there is s such that p ∗ s = q. Definition 1.1 (Trees). T ⊆ Seq is a tree iff: 1. q ∈ T and p 6 q imply p ∈ T , 2. p∗ < n+ 1 >∈ T with n > 1 implies p∗ < n >∈ T . The subtree of T at node p is the tree Tp = {q | p ∗ q ∈ T }.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CS 792 Notes : Lecture

Arranged by Yarom Gabay based on a seminar by Assaf Kfoury March 1, 2005 The references are to Barendregt’s book [1]. So far we have studied the λ-calculus as a rewrite-system , i.e., we have studied properties of reduction, specifically, β-reduction. We can also study the λ-calculus as an equational theory , i.e., an axiomatic system consisting of axioms and inference rules to produce valid eq...

متن کامل

BU CAS CS 332, Spring 2009: Section Notes

This document contains notes corresponding to the material that has been or will be covered during the discussion sections of the spring 2009 iteration of the course BU CAS CS 332, taught by Professor Leonid Levin. These notes will contain intuitive exposition, as well as problems and examples that demonstrate how the definitions and theorems presented during lectures and in the official lectur...

متن کامل

CS 3110 Spring 2016 Lecture 1 : Introduction , Course Plan , Elements of OCaml : Syntax , Evaluation ( 1 / 28 )

These preliminary notes contain far more material that was covered in the first lecture. A redacted copy of the notes will be posted next week. We leave these longer notes up now to help students understand better the nature of the course. The actual lecture only covered material up to OCaml syntax.

متن کامل

CS 49 : Data Stream Algorithms Lecture Notes , Fall 2011 Amit

Acknowledgements These lecture notes began as rough scribe notes for a Fall 2009 offering of the course " Data Stream Algorithms " at Dartmouth College. The initial scribe notes were prepared mostly by students enrolled in the course in 2009. Subsequently, during a Fall 2011 offering of the course, I edited the notes heavily, bringing them into presentable form, with the aim being to create a r...

متن کامل

Factors affecting students tendency of Univercity students to Lecture Notes

Introduction: Many studies detected factors contributing to the students&rsquo; tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005